When Can Finite Testing Ensure Infinite Trustworthiness?

Can Observers Predict Trustworthiness?∗

We analyze experimental evidence on whether untrained subjects can predict how trustworthy an individual is. Two players on a TV show play a high stakes prisoner’s dilemma with pre-play communication. Our subjects report probabilistic beliefs that each player cooperates, before and after communication. Subjects correctly predict that women, and players who voluntarily promise that they will coo...

When Can One Finite Monoid Simulate Another?

Supplement to " Testing Whether Jumps Have Finite or Infinite Activity

When  ≥ 2 these processes are finite-valued, but not necessarily so when   2. In this case we have to be careful: if  = inf( : () =∞) and 0 = inf( :  0() = ∞) then both processes () and  0() are null at 0 and finite-valued on [0 ) and [0 0) respectively, the first continuous and the second one càdlàg with jumps not bigger than 1, and they are infinite on (∞) and (0∞). H...

Testing Whether Jumps Have Finite or Infinite Activity

We propose statistical tests to discriminate between the finite and infinite activity of jumps in a semimartingale discretely observed at high frequency. The two statistics allow for a symmetric treatment of the problem: we can either take the null hypothesis to be finite activity, or infinite activity. When implemented on high-frequency stock returns, both tests point toward the presence of in...

On what we can ensure

The Conjunction Principle says, roughly, that if the truth of a conjunction can be brought about, then the truth of each conjunct can be brought about. The current essay argues that this principle is not valid. After a clarification of the principle, it is shown how a proper understanding of the involved notions falsify the principle. As a corollary, a recent attack on van Inwagen’s Consequence...

Heuristics for fault diagnosis when testing from finite state machines

When testing from Finite State Machines (FSMs), a failure observed in the Implementation Under Test (IUT) is called a symptom. A symptom could have been caused by an earlier state transfer failure. Transitions that may be used to explain the observed symptoms are called diagnosing candidates. Finding strategies to generate an optimal set of diagnosing candidates that could effectively identify ...